Optimization of the MPQS-factoring algorithm on the Cyber 205 and the NEC SX-2
نویسندگان
چکیده
This paper describes the optimization of a program for the factorization of large integers on two large vector processors: a CDC Cyber 205 and a NEC SX-2. The factoring method used is the so-called multiple polynomial version of the quadratic sieve algorithm. Several large integers in the 48–92 decimal digits range have actually been factorized with these two programs. The largest number, the 92-digit composite (6−1)/(5 ·263 ·3931 ·6551), was factorized in about 95 CPUhours on the NEC SX-2. This result means a new absolute record for general purpose factoring methods. 1980 Mathematics Subject Classification (1985) revision: 11Y05, 11A51, 65F05, 65V05, 65W05.
منابع مشابه
Factoring Integers above 100 Digits Using Hypercube Mpqs 1 Scope and Achievements
In this paper we report on further progress with the factorisation of integers using the MPQS algorithm on hypercubes and a MIMD parallel computer with 1024 T805 processors. We were able to factorise a 101 digit number from the Cunningham list using only about 65 hours computing time. We give new details about the hypercube sieve initialisation procedure and describe the structure of the factor...
متن کاملPorting the 3D gyrokinetic particle-in-cell code GTC to the NEC SX-6 vector architecture: perspectives and challenges
Several years of optimization on the cache-based super-scalar architecture has made it more difficult to port the current version of the 3D particle-in-cell code GTC to the NEC SX-6 vector architecture. This paper explains the initial work that has been done to port this code to the SX-6 computer and to optimize the most time consuming parts. After a few modifications, single-processor results ...
متن کاملMulti-objective and Scalable Heuristic Algorithm for Workflow Task Scheduling in Utility Grids
To use services transparently in a distributed environment, the Utility Grids develop a cyber-infrastructure. The parameters of the Quality of Service such as the allocation-cost and makespan have to be dealt with in order to schedule workflow application tasks in the Utility Grids. Optimization of both target parameters above is a challenge in a distributed environment and may conflict one an...
متن کاملMimd{factorisation on Hypercubes Mimd-factorisation on Hypercubes
This paper describes the development and implementation of the MPQS factoring algorithm using multiple hypercubes customised to a MIMD parallel computer. The computationally most expensive steps ran on a Parsytec machine consisting of 1024 Inmos T805 microprocessors. General 100 decimal digit numbers can be factored in 1{2 days.
متن کاملApplication of Stochastic Optimal Control, Game Theory and Information Fusion for Cyber Defense Modelling
The present paper addresses an effective cyber defense model by applying information fusion based game theoretical approaches. In the present paper, we are trying to improve previous models by applying stochastic optimal control and robust optimization techniques. Jump processes are applied to model different and complex situations in cyber games. Applying jump processes we propose some m...
متن کامل